Analysis of Plane Thermoplastic Problems on Doubly-Connected Regions
نویسندگان
چکیده
منابع مشابه
Time-dependent conformal mapping of doubly-connected regions
This paper examines two key features of time-dependent conformal mappings in doubly-connected regions, the evolution of the conformal modulus Q(t) and the boundary transformation generalizing the Hilbert transform. It also applies the theory to an unsteady free surface flow. Focusing on inviscid, incompressible, irrotational fluid sloshing in a rectangular vessel, it is shown that the explicit ...
متن کاملOn doubly light vertices in plane graphs
A vertex is said to be doubly light in a family of plane graphs if its degree and sizes of neighbouring faces are bounded above by a finite constant. We provide several results on the existence of doubly light vertices in various families of plane graph.
متن کاملUnavoidable doubly connected large graphs
A connected graph is double connected if its complement is also connected The following Ramsey type theorem is proved in this paper There exists a function h n de ned on the set of integers exceeding three such that every double connected graph on at least h n vertices must contain as an induced subgraph a special double connected graph which is either one of the following graphs or the complem...
متن کاملExtremal First Dirichlet Eigenvalue of Doubly Connected Plane Domains and Dihedral Symmetry
We deal with the following eigenvalue optimization problem: Given a bounded domain D ⊂ R, how to place an obstacle B of fixed shape within D so as to maximize or minimize the fundamental eigenvalue λ1 of the Dirichlet Laplacian on D \ B. This means that we want to extremize the function ρ 7→ λ1(D \ ρ(B)), where ρ runs over the set of rigid motions such that ρ(B) ⊂ D. We answer this problem in t...
متن کاملDoubly Balanced Connected Graph Partitioning
We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let G=(V,E) be a connected graph with a weight (supply/demand) function p:V→ {−1,+1} satisfying p(V )= ∑ j∈V p(j)=0. The objective is to partition G into (V1, V2) such that G[V1] and G[V2] are connected, |p(V1)|, |p(V2)|≤cp, and max{ |V1| |V2| , |V2| |V1|}≤cs, for some constants cp and cs. When G is 2-connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japan Society of Mechanical Engineers
سال: 1972
ISSN: 0029-0270,2185-9485
DOI: 10.1299/kikai1938.38.689